Simulated Annealing-Based Ant Colony Algorithm for Tugboat Scheduling Optimization
نویسندگان
چکیده
منابع مشابه
Simulated Annealing-Based Ant Colony Algorithm for Tugboat Scheduling Optimization
As the “first service station” for ships in the whole port logistics system, the tugboat operation system is one of the most important systems in port logistics. This paper formulated the tugboat scheduling problem as a multiprocessor task scheduling problem MTSP after analyzing the characteristics of tugboat operation. The model considers factors of multianchorage bases, different operation mo...
متن کاملAnt-colony-algorithm-simulated-annealing- Algorithm-based Optimization Approach for Mcm Interconnect Test
In this paper, a novel optimization approach based on ant colony algorithm (ACA) and simulated annealing algorithm (SA) is presented for the Multi-chip Module (MCM) interconnect test generation problem. In order to apply ACA into the interconnect test, the pheromone updating rule and state transition rule is designed by combing the characteristics of MCM interconnect test generation. By using t...
متن کاملUsing Simulated Annealing and Ant-Colony Optimization Algorithms to Solve the Scheduling Problem
The scheduling problem is one of the most challenging problems faced in many different areas of everyday life. This problem can be formulated as a combinatorial optimization problem, and it has been solved with various methods using meta-heuristics and intelligent algorithms. We present in this paper a solution to the scheduling problem using two different heuristics namely Simulated Annealing ...
متن کاملA Disk Scheduling Algorithm Based on ANT Colony Optimization
Audio, animations and video belong to a class of data known as delay sensitive because they are sensitive to delays in presentation to the users. Also, because of huge data in such items, disk is an important device in managing them. In order to have an acceptable presentation, disk requests deadlines must be met, and a real-time scheduling approach should be used to guarantee the timing requir...
متن کاملFinding the Shortest Hamiltonian Path for Iranian Cities Using Hybrid Simulated Annealing and Ant Colony Optimization Algorithms
The traveling salesman problem is a well-known and important combinatorial optimization problem. The goal of this problem is to find the shortest Hamiltonian path that visits each city in a given list exactly once and then returns to the starting city. In this paper, for the first time, the shortest Hamiltonian path is achieved for 1071 Iranian cities. For solving this large-scale problem, tw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2012
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2012/246978